Certainty and Uncertainty in Quantum Information Processing

This survey, aimed at information processing researchers, highlights intriguing but lesser known results, corrects misconceptions, and suggests research areas. Themes include: certainty in quantum algorithms; the "fewer worlds" theory of quantum mechanics; quantum learning; probability theory versus quantum mechanics.Comment: Invited paper accompanying invited talk to AAAI Spring Symposium 2007. Comments, corrections, and suggestions would be most welcom

An Introduction to Quantum Computing for Non-Physicists

Richard Feynman's observation that quantum mechanical effects could not be simulated efficiently on a computer led to speculation that computation in general could be done more efficiently if it used quantum effects. This speculation appeared justified when Peter Shor described a polynomial time quantum algorithm for factoring integers. In quantum systems, the computational space increases exponentially with the size of the system which enables exponential parallelism. This parallelism could lead to exponentially faster quantum algorithms than possible classically. The catch is that accessing the results, which requires measurement, proves tricky and requires new non-traditional programming techniques. The aim of this paper is to guide computer scientists and other non-physicists through the conceptual and notational barriers that separate quantum computing from conventional computing. We introduce basic principles of quantum mechanics to explain where the power of quantum computers comes from and why it is difficult to harness. We describe quantum cryptography, teleportation, and dense coding. Various approaches to harnessing the power of quantum parallelism are explained, including Shor's algorithm, Grover's algorithm, and Hogg's algorithms. We conclude with a discussion of quantum error correction.Comment: 45 pages. To appear in ACM Computing Surveys. LATEX file. Exposition improved throughout thanks to reviewers' comment

Reply to Norsen's paper "Are there really two different Bell's theorems?"

Yes. That is my polemical reply to the titular question in Travis Norsen's self-styled "polemical response to Howard Wiseman's recent paper." Less polemically, I am pleased to see that on two of my positions --- that Bell's 1964 theorem is different from Bell's 1976 theorem, and that the former does not include Bell's one-paragraph heuristic presentation of the EPR argument --- Norsen has made significant concessions. In his response, Norsen admits that "Bell's recapitulation of the EPR argument in [the relevant] paragraph leaves something to be desired," that it "disappoints" and is "problematic". Moreover, Norsen makes other statements that imply, on the face of it, that he should have no objections to the title of my recent paper ("The Two Bell's Theorems of John Bell"). My principle aim in writing that paper was to try to bridge the gap between two interpretational camps, whom I call 'operationalists' and 'realists', by pointing out that they use the phrase "Bell's theorem" to mean different things: his 1964 theorem (assuming locality and determinism) and his 1976 theorem (assuming local causality), respectively. Thus, it is heartening that at least one person from one side has taken one step on my bridge. That said, there are several issues of contention with Norsen, which we (the two authors) address after discussing the extent of our agreement with Norsen. The most significant issues are: the indefiniteness of the word 'locality' prior to 1964; and the assumptions Einstein made in the paper quoted by Bell in 1964 and their relation to Bell's theorem.Comment: 13 pages (arXiv version) in http://www.ijqf.org/archives/209

The Quantum Frontier

The success of the abstract model of computation, in terms of bits, logical operations, programming language constructs, and the like, makes it easy to forget that computation is a physical process. Our cherished notions of computation and information are grounded in classical mechanics, but the physics underlying our world is quantum. In the early 80s researchers began to ask how computation would change if we adopted a quantum mechanical, instead of a classical mechanical, view of computation. Slowly, a new picture of computation arose, one that gave rise to a variety of faster algorithms, novel cryptographic mechanisms, and alternative methods of communication. Small quantum information processing devices have been built, and efforts are underway to build larger ones. Even apart from the existence of these devices, the quantum view on information processing has provided significant insight into the nature of computation and information, and a deeper understanding of the physics of our universe and its connections with computation. We start by describing aspects of quantum mechanics that are at the heart of a quantum view of information processing. We give our own idiosyncratic view of a number of these topics in the hopes of correcting common misconceptions and highlighting aspects that are often overlooked. A number of the phenomena described were initially viewed as oddities of quantum mechanics. It was quantum information processing, first quantum cryptography and then, more dramatically, quantum computing, that turned the tables and showed that these oddities could be put to practical effect. It is these application we describe next. We conclude with a section describing some of the many questions left for future work, especially the mysteries surrounding where the power of quantum information ultimately comes from.Comment: Invited book chapter for Computation for Humanity - Information Technology to Advance Society to be published by CRC Press. Concepts clarified and style made more uniform in version 2. Many thanks to the referees for their suggestions for improvement